Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics
نویسندگان
چکیده
The complexity of the subsumption problem in description logics can vary widely with the choice of the syntactic fragment and the semantic interpretation. In this paper we show that the constructive semantics of concept descriptions, which includes the classical descriptive semantics as a special case, offers exponential speed-up in the existentialdisjunctive fragment UL of ALC.
منابع مشابه
A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes
Hybrid EL-TBoxes combine general concept inclusions (GCIs), which are interpreted with descriptive semantics, with cyclic concept definitions, which are interpreted with greatest fixpoint (gfp) semantics. We introduce a proof-theoretic approach that yields a polynomial-time decision procedure for subsumption in EL w.r.t. hybrid TBoxes, and present preliminary experimental results regarding the ...
متن کاملOptimization and Implementation of Subsumption Algorithms for the Description Logic El with Cyclic Tboxes and General Concept Inclusion Axioms
The subsumption problem in the description logic (DL) EL has been shown to be polynomial regardless of whether cyclic or acyclic TBoxes are used. Recently, it was shown that the problem remains tractable even when admitting general concept inclusion (GCI) axioms. Motivated by its nice complexity and sufficient expressiveness for some applications, we propose three decision procedures for comput...
متن کاملComplexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
We perform an exhaustive study of the complexity of subsumption in the EL family of lightweight description logics w.r.t. acyclic and cyclic TBoxes. It turns out that there are interesting members of this family for which subsumption w.r.t. cyclic TBoxes is tractable, whereas it is EXPTIME-complete w.r.t. general TBoxes. For other extensions that are intractable w.r.t. general TBoxes, we establ...
متن کاملFinite Lattices Do Not Make Reasoning in ALCI Harder
We consider the fuzzy logic ALCI with semantics based on a finite residuated lattice. We show that the problems of satisfiability and subsumption of concepts in this logic are ExpTime-complete w.r.t. general TBoxes and PSpace-complete w.r.t. acyclic TBoxes. This matches the known complexity bounds for reasoning in crisp ALCI.
متن کاملSubsumption and Instance Problem in ELH w.r.t. General TBoxes
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems remain tractable even when admitting general concept inclusion axioms and simple role inclusion axioms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009